The Numerical Semigroup of Phrases' Lengths in a Simple Alphabet
نویسندگان
چکیده
Let A be an alphabet with two elements. Considering a particular class of words (the phrases) over such an alphabet, we connect with the theory of numerical semigroups. We study the properties of the family of numerical semigroups which arise from this starting point.
منابع مشابه
FLOWS AND UNIVERSAL COMPACTIFICATIONS
The main purpose of this paper is to establish a relation between universality of certain P-compactifications of a semitopological semigroup and their corresponding enveloping semigroups. In particular, we show that if we take P to be the property that the enveloping semigroup of a compactification of a semitopological semigroup s is left simple, a group, or the trivial singleton semigroup, t...
متن کاملA Mealy Machine of Growth
We consider a very simple Mealy machine (three states over a twosymbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function of its balls behaves asymptotically like nα, for α = 1 + log 2/log 1+ √ 5 2 ; that the semigroup satisfies the identity g = g; and that its lattice of two-sid...
متن کاملA Mealy Machine with Polynomial Growth of Irrational Degree
We consider a very simple Mealy machine (two non-trivial states over a two-symbol alphabet), and derive some properties of the semigroup it generates. It is an infinite, finitely generated semigroup, and we show that the growth function of its balls behaves asymptotically like nα, for α = 1 + log 2/log 1+ √ 5 2 ; that the semigroup satisfies the identity g = g; and that its lattice of two-sided...
متن کاملIntersection graphs associated with semigroup acts
The intersection graph $mathbb{Int}(A)$ of an $S$-act $A$ over a semigroup $S$ is an undirected simple graph whose vertices are non-trivial subacts of $A$, and two distinct vertices are adjacent if and only if they have a non-empty intersection. In this paper, we study some graph-theoretic properties of $mathbb{Int}(A)$ in connection to some algebraic properties of $A$. It is proved that the fi...
متن کاملTwo-variable first order logic with modular predicates over words
We consider first order formulae over the signature consisting of the symbols of the alphabet, the symbol < (interpreted as a linear order) and the set MOD of modular numerical predicates. We study the expressive power of FO2[<,MOD], the two-variable first order logic over this signature, interpreted over finite words. We give an algebraic characterization of the corresponding regular languages...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013